A New Class of Q-Ary Codes for the McEliece Cryptosystem

The McEliece cryptosystem is a promising candidate for post-quantum public-key encryption. In this work, we propose q-ary codes over Gaussian integers the system and new channel model. With one Mannheim error channel, errors are limited to weight one. We investigate capacity of discuss its relation system. proposed based on simple product code construction have low complexity decoding algorithm. For these achieve higher correction capability than maximum distance separable with bounded minimum decoding. This improves work factor regarding attacks information-set